Random tree - PDFSEARCH.IO - Document Search Engine

Random tree
Results: 293

#	Item
281	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ Add to Reading List Source URL: www.siam.org Language: English - Date: 2009-12-02 12:21:54 Spanning tree Minimum spanning tree Loop-erased random walk Chernoff bound Eulerian path NP-complete problems Dominating set Holomorphic functional calculus Graph theory Mathematics Theoretical computer science
282	Programme BLANC Document scientifique associé Add to Reading List Source URL: www.univ-orleans.fr Language: English - Date: 2008-09-03 09:03:26 Random walk Brownian excursion Brownian motion Gaussian free field Percolation Scaling limit Random tree Stability Statistics Stochastic processes Probability and statistics
283	RANDOM SAMPLING IN GRAPH OPTIMIZATION PROBLEMS Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2010-10-17 00:28:32 Spanning tree Algorithms Analysis of algorithms Probabilistic complexity theory Randomized algorithm Minimum spanning tree Minimum cut Approximation algorithm David Shmoys Theoretical computer science Mathematics Applied mathematics
284	ENUMERATIONS OF TREES AND FORESTS RELATED TO BRANCHING PROCESSES AND RANDOM WALKS Add to Reading List Source URL: statistics.berkeley.edu Language: English - Date: 2013-02-27 14:45:13 Number theory Tree Factorial Probability-generating function Degree Summation Binomial coefficient Cycle index Mathematics Combinatorics Integer sequences
285	EXACT EXPECTATIONS OF MINIMAL SPANNING TREES FOR GRAPHS WITH RANDOM EDGE WEIGHTS JAMES ALLEN FILL Add to Reading List Source URL: www.ams.jhu.edu Language: English - Date: 2004-04-13 22:16:44 Matroid theory Polynomials Tutte polynomial Petersen graph Graph coloring Graph Minimum spanning tree Chromatic polynomial Matching Graph theory Mathematics Theoretical computer science
286	contains q changes as a result of the ith insertion. Let Pi denote this probability (where the probability is taken over random insertion orders, irrespective of the choice of q). Since q could fall through up to three levels in the search tree as a result of each the insertion, the expected length of q’s search path in the final structure is at most Add to Reading List Source URL: www.skynet.ie Language: English - Date: 2004-09-14 03:56:52 Diagrams Discrete geometry Triangulation Voronoi diagram Delaunay triangulation Sweep line algorithm Doubly connected edge list Convex hull Medial axis Geometry Computational geometry Mathematics
287	Recombining Trinomial Tree for Real Option Valuation with Changing Volatility Tero Haahtela Add to Reading List Source URL: www.realoptions.org Language: English - Date: 2013-03-20 23:51:49 Finance Binomial options pricing model Trinomial tree Lattice model Black–Scholes Volatility Real options valuation Random walk Volatility smile Financial economics Options Mathematical finance
288	J i on Add to Reading List Source URL: www.emis.ams.org Language: English - Date: 2011-12-25 10:54:31 Graph Graph operations Tree decomposition Line graph Graph theory Stochastic processes Random walk
289	PDF Document Add to Reading List Source URL: axon.cs.byu.edu Language: English - Date: 2009-03-05 22:05:59 Decision trees Ensemble learning Data mining Cybernetics Decision tree learning Random forest Pattern recognition Algorithm Boosting Machine learning Computational statistics Artificial intelligence
290	PDF Document Add to Reading List Source URL: www.vldb.org Language: English - Date: 2006-07-29 01:50:33 Graph Tree Shortest path problem Tuple Loop-erased random walk Object-based spatial database Graph theory Mathematics Theoretical computer science

UPDATE